Transforming Non-distributive Hierarchy Schemas into the Distributive Hierarchy Schema
نویسندگان
چکیده
منابع مشابه
Distributive Minimization Comprehensions and the Polynomial Hierarchy
A categorical point of view about minimization in subrecursive classes is presented by extending the concept of Symmetric Monoidal Comprehension to that of Distributive Minimization Comprehension. This is achieved by endowing the former with coproducts and a finality condition for coalgebras over the endofunctor sending X to 1 ⊕X to perform a safe minimization operator. By relying on the charac...
متن کاملComparing Distributive and Non - Distributive Conflict Transitions
(Preliminary draft; references incomplete. Feedback welcome to [email protected] and [email protected], but please do not circulate.)
متن کاملOn the Distributive and Non-Distributive Interpretation in Japanese
Through an analysis of two different types of floating numeral quantifier (FNQ) constructions in Japanese, the present paper investigates the distributive and non-distributive interpretation in Japanese. Discussion of the interpretative issues related to ambiguity and intonation has indicated that FNQs are potentially ambiguous, offering both distributive and non-distributive readings.
متن کاملNon-matchable distributive lattices
Based on an acyclic orientation of the Z-transformation graph, a finite distributive lattice (FDL for short)M(G) is established on the set of all 1-factors of a plane (weakly) elementary bipartite graph G. For an FDL L, if there exists a plane bipartite graph G such that L is isomorphic to M(G), then L is called a matchable FDL. A natural question arises: Is every FDL a matchable FDL? In this p...
متن کاملThe restricted core of games on distributive lattices: how to share benefits in a hierarchy
Finding a solution concept is one of the central problems in cooperative game theory, and the notion of core is the most popular solution concept since it is based on some rationality condition. In many real situations, not all possible coalitions can form, so that classical TU-games cannot be used. An interesting case is when possible coalitions are defined through a partial ordering of the pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2011
ISSN: 1598-849X
DOI: 10.9708/jksci.2011.16.11.233